The path-distance-width of hypercubes
نویسنده
چکیده
The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i. In this note, we determine the path-distance-width of hypercubes.
منابع مشابه
Edge Congestion and Topological Properties of Crossed Cubes
An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...
متن کاملOptimal Routing for Odd-Even Rotations on BRGC Hypercubes
It has been an open problem for a long time whether there exists an optimal routing algorithm for rotations on BRGC hypercubes such that all the paths are shortest and link-disjoint. In this paper, we consider the routing problem of odd-even rotations on BRGC hypercubes. It is a generalization of the rotation problem on BRGC hypercubes such that even nodes and odd nodes can have different rotat...
متن کاملOptimal Broadcasting in Injured Hypercubes Using Directed Safety Levels
Reliable communication in injured hypercubes with faulty links nodes using directed safety levels is studied in this paper In this approach each node u in an n dimensional hypercube n cube is associated with a sequence of directed safety levels A directed safety level asso ciated with node u is an approximated measure of broadcast capability of performing optimal broadcasting from u in an n sub...
متن کاملAdaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n 1 node faults and can route a message via a path of length no more than the Hamming distance between the s...
متن کاملThe relationship between corresponding upper buccal cusp distance (IBD) and Gothic arch width, inter - condylar width (ICW) and inter-upper canine distance (ICD) in an Iranian population
The relationship between corresponding upper buccal cusp distance (IBD) and Gothic arch width, inter - condylar width (ICW) and inter-upper canine distance (ICD) in an Iranian population Dr. H. Dorriz* - Dr. A. Mohammadi** *- Assistant Professor of Prosthodontics Dept. – Faculty of Dentistry – Tehran University of Medical Sciences. **- Resident of Prosthodontics Dept. – Faculty of Dentistry – M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 33 شماره
صفحات -
تاریخ انتشار 2013